Quantum Coding Theorem from Privacy and Distinguishability

Quantum Coding Theorem from Privacy and Distinguishability

Quantum sources and a quantum coding theorem

We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon-McMillan noiseless coding theorem. Along the way ...

Wigner-Araki-Yanase theorem on Distinguishability

Takayuki Miyadera ∗ and Hideki Imai ∗,† ∗ Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST). Daibiru building 1102, Sotokanda, Chiyoda-ku, Tokyo, 101-0021, Japan. (e-mail: [email protected]) † Graduate School of Science and Engineering Course of Electrical, Electronic, and Communication Engineering, Chuo Universit...

Constructing elastic distinguishability metrics for location privacy

With the increasing popularity of hand-held devices, location-based applications and services have access to accurate and real-time location information, raising serious privacy concerns for their users. The recently introduced notion of geo-indistinguishability tries to address this problem by adapting the well-known concept of differential privacy to the area of location-based systems. Althou...

Quantum Coding Theorem for Mixed States

We prove a theorem for coding mixed-state quantum signals. For a class of coding schemes, the von Neumann entropy S of the density operator describing an ensemble of mixed quantum signal states is shown to be equal to the number of spin-1/2 systems necessary to represent the signal faithfully. This generalizes previous works on coding pure quantum signal states and is analogous to the Shannon’s...